Cliques and duplication–divergence network growth
نویسندگان
چکیده
منابع مشابه
Cliques and duplication-divergence network growth.
A population of complete subgraphs or cliques in a protein network model is studied. The network evolves via duplication and divergence supplemented with linking a certain fraction of target-replica vertex pairs. We derive a clique population distribution, which scales linearly with the size of the network and is in a perfect agreement with numerical simulations. Fixing both parameters of the m...
متن کاملCliques Role in Organizational Reputational Influence: A Social Network Analysis
Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...
متن کاملDetecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between our formulation with a new algebraic tool, namely Radon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Practical approximation al...
متن کاملA Network-Cliques Based Role Mining Model
Role mining for Role-Based Access Control (RBAC) has emerged as a challenging area of information security. Current role mining models are mainly based on data mining with RBAC semantics and are not the pure mathematical models. Almost every model need a specific algorithm and the expressions of results and process are not vivid and explicit enough. To address these problems, this study propose...
متن کاملNumber of cliques in random scale-free network ensembles
In this paper we calculate the average number of cliques in random scale-free networks. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e. fully connected subgraphs, appear also when the average degree is finite. This is in contrast to what happens in Erdös and Renyi graphs in which diverging average degree is requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2005
ISSN: 1367-2630
DOI: 10.1088/1367-2630/7/1/145